Bit-Parallel Operations to Investigate Properties of Logical Vectors by Logical Operations
نویسندگان
چکیده
In this paper, we discuss five problems which can be solved by using bit-parallel approach in constant time. And, these five problems often occur in many problems such as exact string matching problems and approximation string matching problems. According to the approaches for these five problems, we can solve exact string matching problems and approximation string matching problems more efficiently.
منابع مشابه
Multiple-Pattern Matching Using Improved Bit-Parallel Approach
We consider a fundamental problem testing if every bit is zero in a bit vector in a so-called bit-parallel machine. In this machine, a machine word can have unlimited number of bits, and logical operations such as bitwise-and, bitwise-or, and so on, can be done in O(1) time. However, in each time, only one bit in a bit vector can be examined. We show how to solve this fundamental problem in O(1...
متن کاملAn Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors
In this paper we describe a decision procedure for the core theory of xed-sized bit-vectors with extraction and composition than can readily be integrated into Shostak's procedure for deciding combinations of theories. Inputs to the solver are unquantiied bit-vector equations t = u and the algorithm returns true if t = u is valid in the bit-vector theory, false if t = u is unsatissable, and a s...
متن کاملExperiments in Computing Sequences of Reversals
This paper discusses a bit-vector implementation of an algorithm that computes an optimal sequence of reversals that sorts a signed permutation. The main characteristics of the implementation are its simplicity , both in terms of data structures and operations, and the fact that it exploits the parallelism of bit-wise logical operations.
متن کاملSupervenience and Infinitary Logic
The discussion of supervenience is replete with the use of infinitary logical operations. For instance, one may often find a supervenient property that corresponds to an infinite collection of supervenience-base properties, and then ask about the infinite disjunction of all those base properties. This is crucial to a well-known argument of Kim (1984) that supervenience comes nearer to reduction...
متن کاملImplementation of Data Flow Logical Operation via Self-Assembly of DNA
Self-assembly of DNA is considered a fundamental operation in realization of molecular logic circuits. We propose a new approach to implementation of data flow logical operations based on manipulating DNA strands. In our method the logic gates, input, and output signals are represented by DNA molecules. Each logical operation is carried out as soon as the operands are ready. This technique empl...
متن کامل